Minimizing weighted total earliness, total tardiness and setup costs

A single machine scheduling problem is described which covers earliness costs, tardiness costs and setup costs. Setups are needed whenever a switch is made to a job of another product family. All jobs within the same product family have the same processing time. Besides setup costs also setup times are involved. Idle time is allowed, preemption is not allowed. Both a mixed integer programming formulation and a Branch and Bound approach are presented which solve the problem optimally. Experimental results are given for a number of heuristic methods. 1 Faculty of Management and Organization, University of Groningen, P.O. box 800, 9700 AV, The Netherlands. This research was sponsored by the (former) Economics Research Foundation, which is part of the Netherlands Organization for Scientific Research (NWO). 2 Faculty of Management and Organization, University of Groningen, The Netherlands. 3 Department of Mechanical Engineering, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands.